Concatenable Structures for Decomposable Problems

Decomposable Searching Problems

In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each b...

Order Statistics for Decomposable Combinatorial Structures

In this paper we consider the component structure of decomposable combinatorial objects, both labeled and unlabeled, from a probabilistic point of view. In both cases we show that when the generating function for the components of a structure is a logarithmic function, then the joint distribution of the normalized order statistics of the component sizes of a random object of size n converges to...

Complexity measures in decomposable structures

In this paper we present some measures of complexity of decomposable structures. The literature on complexity is reviewed and then the distinction among different measures of complexity is discussed. At first, a broad definition of complex systems is provided and the main characteristics of such systems are described briefly. In particular, a complex system is defined as a network of many highl...

Easy Problems for Tree-Decomposable Graphs

An Extended Atms for Decomposable Problems

When dealing with nearly decomposable problems such as those described by Simon (1973), the problem components may be worked on by different problem solvers that are spatially and temporally separated, with each problem solver constrained by assumptions it makes about the activities and choices of other problem solvers, that is by partial knowledge of the global problem. There are advantages to...